Strategic Facility Location with Clients That Minimize Total Waiting Time

We study a non-cooperative two-sided facility location game in which facilities and clients behave strategically. This is contrast to many other games simply visit their closest facility. Facility agents select on graph open attract as much purchasing power possible, while client choose patronize by strategically distributing order minimize total waiting time. Here, the time of depends its received power. show that our stage an atomic splittable congestion game, implies existence, uniqueness efficient computation equilibrium. Therefore, can efficiently predict behavior make strategic decisions accordingly. Despite that, we prove subgame perfect equilibria do not exist all instances this existence NP-hard decide. On positive side, provide simple algorithm compute 3-approximate equilibria.